Probabilistic location-free addressing in wireless networks

Multi-hop wireless networks, such as sensor, ad hoc and mesh networks, suffer from permanent topology dynamics due to unstable wireless links and node mobility. Stable addressing, as needed for reliable routing, in such evolving, challenging network conditions is thus a difficult task. Efficient multihop wireless communication in these networks then requires a fully decentralized, scalable routable addressing scheme that embraces network dynamics and dynamically recovers from failures. In this paper, we present Probabilistic ADdressing (PAD), a virtual coordinate based addressing mechanism that efficiently deals with dynamic communication links in wireless networks. PAD estimates statistical distributions of hop distances between nodes to (i) assign fuzzy routable regions to nodes instead of discrete addresses, and (ii) provide a distributed storage service to store and retrieve node addresses. We evaluate PAD both in simulations and in widely used testbeds. Our results highlight the graceful topology maintenance and recovery of PAD in challenging networking conditions due to node mobility and unstable link conditions. Precisely, we observe that, when compared with the state-of-theart, our proposed mechanism achieves an order of magnitude fewer address changes in the network translating into less overhead traffic and high packet success. & 2013 Elsevier Ltd. All rights reserved.